Lower bounds forr2(K1+G)andr3(K1+G)from Paley graph and generalization
نویسندگان
چکیده
منابع مشابه
A Generalization of Generalized Paley Graphs and New Lower Bounds for R(3,q)
Generalized Paley graphs are cyclic graphs constructed from quadratic or higher residues of finite fields. Using this type of cyclic graphs to study the lower bounds for classical Ramsey numbers, has high computing efficiency in both looking for parameter sets and computing clique numbers. We have found a new generalization of generalized Paley graphs, i.e. automorphism cyclic graphs, also havi...
متن کاملA Generalization of Opsut's Lower Bounds for the Competition Number of a Graph
The notion of a competition graph was introduced by J. E. Cohen in 1968. The competition graph C(D) of a digraph D is a (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if there exists a vertex v in D such that (x, v) and (y, v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the...
متن کاملLower Bounds for the Graph Homomorphism Problem
The graph homomorphism problem (HOM) asks whether the vertices of a given n-vertex graph G can be mapped to the vertices of a given h-vertex graph H such that each edge of G is mapped to an edge of H. The problem generalizes the graph coloring problem and at the same time can be viewed as a special case of the 2-CSP problem. In this paper, we prove several lower bounds for HOM under the Exponen...
متن کاملLower Bounds for On-line Graph Colorings
We propose three strategies for Presenter in on-line graph coloring games. The first one constructs bipartite graphs and forces any on-line coloring algorithm to use 2 log2 n − 10 colors, where n is the number of vertices in the constructed graph. This is best possible up to an additive constant. The second strategy constructs triangle-free graphs and forces Ω(n 1 2 ) colors. The third one cons...
متن کاملLower bounds for sensitivity of graph properties
We prove that the sensitivity of any non-trivial graph property on n vertices is at least b 12nc , provided n is sufficiently large.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2014
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2014.02.007